/*
 * @Date: 2021-09-09 15:59:00
 * @Author: Acckno1
 * @LastEditTime: 2021-09-09 16:11:49
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 5e4 + 10;

int pre_order[N], in_order[N];
unordered_map<int, int> pos;
int n;
int post_order[N], idx;

// 数据范围太大 需要用哈希表来存储中序结点位置使得能用O(1)时间获取到位置
void postorder(int u, int s, int e) {
    if (s > e) return ;
    int i;
    i = pos[pre_order[u]];
    if (i > s) postorder(u + 1, s, i - 1);
    if (i < e) postorder(u + 1 + i - s, i + 1, e);
    post_order[idx ++ ] = in_order[i];
}

inline void solution() {
    cin >> n;
    for (int i = 0; i < n; i ++ ) cin >> pre_order[i];
    for (int i = 0; i < n; i ++ ) {
        cin >> in_order[i];
        pos[in_order[i]] = i;
    }
    postorder(0, 0, n - 1);
    cout << post_order[0] << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}